Parameterized low-rank binary matrix approximation
نویسندگان
چکیده
منابع مشابه
Parameterized Low-Rank Binary Matrix Approximation
We provide a number of algorithmic results for the following family of problems: For a given binary m × n matrix A and integer k, decide whether there is a “simple” binary matrix B which differs from A in at most k entries. For an integer r, the “simplicity” of B is characterized as follows. • Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete alre...
متن کاملLocal Low-Rank Matrix Approximation
Matrix approximation is a common tool in recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is locally of low-rank, leading to a representation of the observed matrix as a weighted sum of low...
متن کاملSchur method for low-rank matrix approximation
The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...
متن کاملLow Rank Matrix Approximation in Linear Time
Given a matrix M with n rows and d columns, and fixed k and ε, we present an algorithm that in linear time (i.e., O(N)) computes a k-rank matrix B with approximation error ‖M−B‖2F ≤ (1+ ε)μopt(M, k), where N = nd is the input size, and μopt(M, k) is the minimum error of a k-rank approximation to M. This algorithm succeeds with constant probability, and to our knowledge it is the first linear-ti...
متن کاملParameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix
We study approximation and parameterized algorithms for R||Cmax, focusing on the problem when the rank of the matrix formed by job processing times is small. Bhaskara et al. [2] initiated the study of approximation algorithms with respect to the rank, showing that R||Cmax admits a QPTAS (Quasi-polynomial time approximation scheme) when the rank is 2, and becomes APX-hard when the rank is 4. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2020
ISSN: 1384-5810,1573-756X
DOI: 10.1007/s10618-019-00669-5